Permutation based K-Means Clustering Approach for Energy Conservation in MANETs
نویسندگان
چکیده
One of the important issue in MANETs is an energy saving and security. Each node in MANETs has limited energy resource, so that the lifetime of the network is one of the major critical issues. This paper studied SVM data aggregation method for classifying nodes according to their threshold values, this method eliminated the data redundancy and outliers but classification method is not much enough to reserve energy by power degradation on nodes in MANET. The sources of energy conservation are transmission cost, encryption/decryption, reducing data redundancy and transmission time in MANETs. Here P-coding can offered security based on symmetric key encryption, but symmetric key algorithms are not sufficient to provide security in MANETs. This paper introduce new scheme of energy saving called “Permutation based K-means Clustering” (PKMC) proposed for MANETs, which improves overheads, packet drops, transparency, security and energy efficiency. By the use of Permutation and K-means clustering, multiple clusters can be form with similar objects and each object provides security to data during data transmission. Thus, Permutation based K-means clustering contains minimum energy conservation as compares to previous data aggregation and encryption/decryption methods.
منابع مشابه
A Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملA hybrid DEA-based K-means and invasive weed optimization for facility location problem
In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملFuzzy Clustering Approach Using Data Fusion Theory and its Application To Automatic Isolated Word Recognition
In this paper, utilization of clustering algorithms for data fusion in decision level is proposed. The results of automatic isolated word recognition, which are derived from speech spectrograph and Linear Predictive Coding (LPC) analysis, are combined with each other by using fuzzy clustering algorithms, especially fuzzy k-means and fuzzy vector quantization. Experimental results show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015